github.com/andybalholm/brotli.blockEncoder.depths_ (field)

20 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L1112: 	depths_           []byte
		brotli_bit_stream.go#L1124: 		self.depths_ = self.depths_[:0]
		brotli_bit_stream.go#L1177: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1202: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1208: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1209: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1211: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1222: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1229: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1230: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1232: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1243: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1250: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1251: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1253: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1264: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)